101![Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity [Cryptology ePrint Archive, ReportBenoˆıt Chevallier-Mames1 , Mathieu Ciet2 , and Marc Joye1 1 Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity [Cryptology ePrint Archive, ReportBenoˆıt Chevallier-Mames1 , Mathieu Ciet2 , and Marc Joye1 1](https://www.pdfsearch.io/img/1e9b1e70688650a987c2f4586634fb6c.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2003-11-12 11:22:51
|
---|
102![A Simple Entropy-Based Algorithm for Planar Point Location∗ Sunil Arya† Theocharis Malamatos‡ David M. Mount§ A Simple Entropy-Based Algorithm for Planar Point Location∗ Sunil Arya† Theocharis Malamatos‡ David M. Mount§](https://www.pdfsearch.io/img/17243c6b5f2fb45ed6c040923c0f7a83.jpg) | Add to Reading ListSource URL: www.cse.ust.hkLanguage: English - Date: 2007-02-02 02:49:19
|
---|
103![Latent Class Analysis Jeroen K. Vermunt & Jay Magidson The basic idea underlying latent class (LC) analysis is a very simple one: some of the parameters of a postulated statistical model differ across unobserved subgroup Latent Class Analysis Jeroen K. Vermunt & Jay Magidson The basic idea underlying latent class (LC) analysis is a very simple one: some of the parameters of a postulated statistical model differ across unobserved subgroup](https://www.pdfsearch.io/img/6cca03bdd3e839529fd8938158eaf7c7.jpg) | Add to Reading ListSource URL: statisticalinnovations.comLanguage: English - Date: 2006-09-05 12:11:48
|
---|
104![Generalised Eigenspaces and the block upper triangular form In pp. 300–304 of his book Linear Algebra, M. O’Nan gives a simple algorithm for finding a block upper triangular form similar to a given matrix whose chara Generalised Eigenspaces and the block upper triangular form In pp. 300–304 of his book Linear Algebra, M. O’Nan gives a simple algorithm for finding a block upper triangular form similar to a given matrix whose chara](https://www.pdfsearch.io/img/b56087cabdc63ff8c7c71d30d14973bb.jpg) | Add to Reading ListSource URL: www.numbertheory.orgLanguage: English - Date: 2002-01-31 03:15:38
|
---|
105![Simple Rules for Low-Knowledge Algorithm Selection? J. Christopher Beck and Eugene C. Freuder Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Cork, Ireland {c.beck,e.freuder}@ Simple Rules for Low-Knowledge Algorithm Selection? J. Christopher Beck and Eugene C. Freuder Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Cork, Ireland {c.beck,e.freuder}@](https://www.pdfsearch.io/img/cbbc31a45770451a074b7253d990cc03.jpg) | Add to Reading ListSource URL: tidel.mie.utoronto.caLanguage: English - Date: 2006-01-18 12:07:28
|
---|
106![Weighted Random Sampling over Data Streams arXiv:1012.0256v1 [cs.DS] 1 Dec 2010 Pavlos S. Efraimidis Department of Electrical and Computer Engineering, Weighted Random Sampling over Data Streams arXiv:1012.0256v1 [cs.DS] 1 Dec 2010 Pavlos S. Efraimidis Department of Electrical and Computer Engineering,](https://www.pdfsearch.io/img/a3fdfeeeedd1ba97f8d01592ca2f5b92.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2010-12-01 20:14:46
|
---|
107![What algorithms are supported in Figaro? Current built-in algorithms include: Exact inference using variable elimination What algorithms are supported in Figaro? Current built-in algorithms include: Exact inference using variable elimination](https://www.pdfsearch.io/img/e77f2f8582bdc5890e8d81cea2dc1989.jpg) | Add to Reading ListSource URL: www.cra.comLanguage: English - Date: 2014-11-17 13:08:42
|
---|
108![Homework Five, for Fri[removed]CSE 101 When specifying an algorithm, please use pseudocode that is simple and unambiguous. Always justify the correctness and running time of the algorithm, unless these are obvious. Homework Five, for Fri[removed]CSE 101 When specifying an algorithm, please use pseudocode that is simple and unambiguous. Always justify the correctness and running time of the algorithm, unless these are obvious.](https://www.pdfsearch.io/img/ef9d2ae795c17931d63f1757bd1fd3a7.jpg) | Add to Reading ListSource URL: cseweb.ucsd.edu- Date: 2014-11-01 14:36:32
|
---|
109![Verifiable Encryption of Digital Signatures and Applications GIUSEPPE ATENIESE The Johns Hopkins University This paper presents a new simple schemes for verifiable encryption of digital signatures. We make Verifiable Encryption of Digital Signatures and Applications GIUSEPPE ATENIESE The Johns Hopkins University This paper presents a new simple schemes for verifiable encryption of digital signatures. We make](https://www.pdfsearch.io/img/c247d8afae8608e301d949e870133b48.jpg) | Add to Reading ListSource URL: www.cs.jhu.eduLanguage: English - Date: 2004-05-21 14:56:23
|
---|
110![Near Optimal Tree Size Bounds on a Simple Real Root Isolation Algorithm Vikram Sharma Institute of Mathematical Sciences Chennai, India[removed] Near Optimal Tree Size Bounds on a Simple Real Root Isolation Algorithm Vikram Sharma Institute of Mathematical Sciences Chennai, India[removed]](https://www.pdfsearch.io/img/64a34d88177756015ae523056d1d3e0a.jpg) | Add to Reading ListSource URL: www.cs.nyu.eduLanguage: English - Date: 2012-03-23 13:26:04
|
---|